A computer / human mastermind player using grids
نویسنده
چکیده
This paper introduces a grid-based strategy for determining the secret code in the game Mastermind. The grids allow for a decent human player, while also providing a computer player that always has explicit knowledge of the progress.
منابع مشابه
Using Player Type Models for Personalized Game Design - An Empirical Investigation
Personalized games should provide a better player experience than one-size-fits-all games. As a method for personalization, player type models have been discussed recently. Player type models would be useful tools in the personalization of games, if they have a relationship to the players’ experience of specific game mechanics. However, this relationship has never been empirically investigated....
متن کاملThe number of pessimistic guesses in Generalized Black-peg Mastermind
Mastermind is a famous two-player game, where the codemaker has to choose a secret code and the codebreaker has to guess it in as few questions as possible using information he receives from the codemaker after each guess. In Generalized Black-peg Mastermind for given arbitrary numbers p, c, the secret code consists of p pegs each having one of c colors, and the received information consists on...
متن کاملThe number of pessimistic guesses in Generalized Mastermind
Mastermind is a famous two-player game, where the codemaker has to choose a secret code and the codebreaker has to guess it in as few questions as possible. The code consists of 4 pegs, each of which is one of 6 colors. In Generalized Mastermind a general number p of pegs and a general number c of colors is considered. Let f(p, c) be the pessimistic number of questions for the generalization of...
متن کاملImproved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
In the past three decades, deductive games have become interesting from the algorithmic point of view. Deductive games are two players zero sum games of imperfect information. The first player, called ”codemaker”, chooses a secret code and the second player, called ”codebreaker”, tries to break the secret code by making as few guesses as possible, exploiting information that is given by the cod...
متن کامل"mastermind by Importance Sampling and Metropolis- Hastings"
Two machine learning algorithms are introduced for playing a one player version of the logical game Mastermind. In the classic game of Mastermind there are two players: the encoder and the decoder. The encoder builds a secret code by selecting a sequence of four pegs, each chosen from six different colors. The decoder then attempts to guess the secret code in as few turns as possible. In this v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- South African Computer Journal
دوره 30 شماره
صفحات -
تاریخ انتشار 2003